Primal-dual regularized SQP and SQCQP type methods for convex programming and their complexity analysis
نویسندگان
چکیده
This paper presents and studies the iteration-complexity of two new inexact variants of Rockafellar’s proximal method of multipliers (PMM) for solving convex programming (CP) problems with a finite number of functional inequality constraints. In contrast to the first variant which solves convex quadratic programming (QP) subproblems at every iteration, the second one solves convex constrained quadratic QP subproblems. Their complexity analysis are performed by: a) viewing the original CP problem as a monotone inclusion problem (MIP); b) proposing a largestep inexact higher-order proximal extragradient framework for MIPs, and; c) showing that the above two PMM variants are just instances of this framework. 2000 Mathematics Subject Classification: 90C25, 90C30, 47H05.
منابع مشابه
A Regularized Sqp Method with Convergence to Second-order Optimal Points
Regularized and stabilized sequential quadratic programming methods are two classes of sequential quadratic programming (SQP) methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a regularized SQP method has been proposed that provides a strong connection between augmented Lagrangian methods and...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملA Globally Convergent Stabilized Sqp Method: Superlinear Convergence
Regularized and stabilized sequential quadratic programming (SQP) methods are two classes of methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a regularized SQP method has been proposed that allows convergence to points satisfying certain second-order KKT conditions (SIAM J. Optim., 23(4):198...
متن کاملA Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct
Quadratic programs (QP) with an indefinite Hessian matrix arise naturally in some direct optimal control methods, e.g. as subproblems in a sequential quadratic programming (SQP) scheme. Typically, the Hessian is approximated with a positive definite matrix to ensure having a unique solution; such a procedure is called regularization. We present a novel regularization method tailored for QPs wit...
متن کاملA Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control
Quadratic programs (QP) with an indefinite Hessian matrix arise naturally in some direct optimal control methods, e.g. as subproblems in a sequential quadratic programming (SQP) scheme. Typically, the Hessian is approximated with a positive definite matrix to ensure having a unique solution; such a procedure is called regularization. We present a novel regularization method tailored for QPs wit...
متن کامل